Hardware and Virtual Machines

Write the Boolean logic expression that corresponds to the given truth table as the sum-of-products.

Z = ............................................................................................................................................

.............................................................................................................................................

Complete the Karnaugh map (K-map) for the given truth table.

Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.

Write the Boolean logic expression from your answer to part (b)(ii) as the simplified sum-of-products.

Z = .....................................................................................................................................

.....................................................................................................................................

Complete the truth table for the given logic circuit.
Show your working.

Write the Boolean logic expression that corresponds to the given logic circuit as the sum-of-products.

Z = ............................................................................................................................................

.............................................................................................................................................

Use Boolean algebra including De Morgan’s laws to simplify the following expression.
Show all working.

$(\overline{A + B}) \cdot (\overline{A \cdot B + B \cdot C})$

Working .....................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

Simplified expression ................................................................................................................

...................................................................................................................................................

Write the Boolean logic expression that corresponds to the given truth table as the sum-of-products.

Z = ............................................................................................................................................

.............................................................................................................................................

Complete the Karnaugh map (K-map) for the given truth table.

Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.

Write the Boolean logic expression from your answer to part (b)(ii) as the simplified sum-of-products.

Z = .....................................................................................................................................

.....................................................................................................................................

The diagram shows a logic circuit.

Complete the truth table for the given logic circuit. Show your working.

Complete the Karnaugh map (K-map) for the Boolean expression:

$\overline{A} \cdot B \cdot C + \overline{A} \cdot B \cdot \overline{C} + A \cdot \overline{B} \cdot C + A \cdot B \cdot \overline{C}$

Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.

Write the Boolean expression from your answer to part b(ii) as a simplified sum-of-products. Do not carry out any further simplification.

...................................................................................................................................................

.............................................................................................................................................

The diagram shows a logic circuit.

Complete the truth table for the given logic circuit.
Show your working.

Complete the Karnaugh map (K-map) for the Boolean expression:

$\overline{A} \cdot \overline{B} \cdot C + \overline{A} \cdot B \cdot C + A \cdot \overline{B} \cdot C + A \cdot B \cdot \overline{C}$

Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.

Write the Boolean expression from your answer to part b(ii) as a simplified sum-of-products. Do not carry out any further simplification.

Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.

Write the Boolean expression from your answer to part a(i) as a simplified sum-of-products. Do not carry out any further simplification.

...........................................................................................................................................

.....................................................................................................................................

Simplify the following expression using De Morgan’s laws and Boolean algebra.

Show all the stages in your simplification.

$X = \overline{A+B+C+\overline{B}+C}$

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

.............................................................................................................................................

Complete the truth table for the given logic circuit.

Show your working.

Write the Boolean expression that corresponds to the logic circuit as a sum-of-products.

Z = ............................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

.............................................................................................................................................

Complete the Karnaugh map (K-map) for the Boolean expression:

$\overline{A}.B.\overline{C} + \overline{A}.B.C + A.\overline{B}.\overline{C} + A.\overline{B}.C + A.B.\overline{C} + A.B.C$

Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.

Write the Boolean expression from your answer to part (c)(ii) as a simplified sum-of-products.

...........................................................................................................................................

.....................................................................................................................................

State two features of RISC processors.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

.............................................................................................................................................

Outline the process of interrupt handling as it could be applied to RISC or CISC processors.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

.............................................................................................................................................

Explain how pipelining affects interrupt handling for RISC processors.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

.............................................................................................................................................

Complete the truth table for the given logic circuit.
Show your working.

Write the Boolean expression that corresponds to the logic circuit as a sum-of-products.

Z = ............................................................................................................................................

Complete the Karnaugh map (K-map) for this Boolean expression:

$\overline{A} \cdot \overline{B} \cdot \overline{C} + \overline{A} \cdot B \cdot \overline{C} + \overline{A} \cdot B \cdot C + A \cdot \overline{B} \cdot \overline{C} + A \cdot B \cdot \overline{C} + A \cdot B \cdot C$

Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.

Write the Boolean expression from your answer to part c(ii) as a simplified sum-of-products.

Outline two benefits and two limitations of a virtual machine.

Benefit 1 ...................................................................................................................................

Benefit 2 ...................................................................................................................................

Limitation 1 ...............................................................................................................................

Limitation 2 ...............................................................................................................................

Explain the roles of the host operating system and the guest operating system as used in a computer system running a virtual machine.